Generalized solution sets of the interval generalized Sylvester matrix equation ∑i=1pAiXi+∑j=1qYjBj=C and some approaches for inner and outer estimations
نویسندگان
چکیده
منابع مشابه
Efficient Approaches for Enclosing the United Solution Set of the Interval Generalized Sylvester Matrix Equation
In this work, we investigate the interval generalized Sylvester matrix equation AXB+ CXD = F and develop some techniques for obtaining outer estimations for the so-called united solution set of this interval system. First, we propose a modified variant of the Krawczyk operator which causes reducing computational complexity to cubic, compared to Kronecker product form. We then propose an iterati...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملon the numerical solution of generalized sylvester matrix equations
the global fom and gmres algorithms are among the effective methods to solve sylvester matrix equations. in this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two cg-type algorithms for solving generalized sylvester matrix equations. the proposed methods are iterative projection metho...
متن کاملOn the Numerical Solution of Generalized Sylvester Matrix Equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection methods onto matrix Kr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2014
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2014.10.014